Visual Constraint Rules
نویسنده
چکیده
Visual rule-based languages have been used quite successfully to program graphical simulations. They all use rewrite rules, which have the often-mentioned advantage that a program can supposedly be extended simply by adding a few more rules. In practice however, the rules tend to depend on each other, and instead of just adding rules, existing rules need to be changed. Visual constraint rules combine ideas from rule-based programming and constraint programming to create declarative forward-chaining-like rules that can be used in a more modular way to support iterative programming. Libraries of visual descriptions can be built and reused to compose complex behavior, which makes exploring the space of possible descriptions of simulations easier. This is valuable for the intended educational use of Cartoonist, a visual programming environment to build simulations. Furthermore, constraint rules also provide a way to describe a variety of parallel behaviors that are important in simulations, yet are not supported by similar systems.
منابع مشابه
Identification of Crosscutting Concerns in Constraint-Driven Validated Model Transformations
Domain-specific model processors facilitate the efficient synthesis of application programs from software models. Often, model compilers are realized by graph rewriting-based model transformation. In Visual Modeling and Transformation System (VMTS), metamodel-based rewriting rules facilitate to assign Object Constraint Language (OCL) constraints to model transformation rules. This approach supp...
متن کاملInvestigating Reasoning with Constraint Diagrams
Constraint diagrams are a visual notation designed to express logical constraints. Augmenting the diagrams with a reading tree (effectively a partial ordering of quantifiers) ensures that each diagram has a unique semantic interpretation. In this paper, we discuss examples of reasoning rules for augmented constraint diagrams which exhibit interesting properties or difficulties that can arise wh...
متن کاملTowards Term Rewriting Systems in Constraint Handling Rules Coming to terms with jungles
Term rewriting systems are a formalism in widespread use, often implemented by means of term graph rewriting. In this work we present preliminary results towards an elegant embedding of term graph rewriting in Constraint Handling Rules with rule priorities (CHR). As term graph rewriting is well-known to be incomplete with respect to term rewriting, we aim for sound jungle evaluation in CHR. Hav...
متن کاملThe Mathematics of Diagrammatic Logical Systems
The focus of my PhD was on spider diagrams and constraint diagrams. Constraint diagrams are a visual language for expressing logical statements. The spider diagram language forms a fragment of the constraint diagram language. I developed two diagrammatic reasoning systems. The first of these, based on spider diagrams, directly extends previous work. The second system is based on the more expres...
متن کاملOptimization Algorithms For OCL Compilers
Constraint handling is one of the most focused research field in both model validation and model transformation. Constraints are often simple topological conditions such as multiplicity checks, but the main strength of the constraint validation lies in the textual constraints defined in high-level languages. Object Constraint Language (OCL) is a wide-spread formalism to express model constraint...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Vis. Lang. Comput.
دوره 8 شماره
صفحات -
تاریخ انتشار 1997